Phenomena of Power: Authority, Domination, and Violence

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Restricted power domination and fault-tolerant power domination on grids

The power domination problem is to find a minimum placement of phase measurement units (PMUs) for observing the whole electric power system, which is closely related to the classical domination problem in graphs. For a graph G = (V , E), the power domination number of G is the minimum cardinality of a set S ⊆ V such that PMUs placed on every vertex of S results in all of V being observed. A ver...

متن کامل

Protective factors for adolescent violence against authority.

Both the family and school environments influence adolescents' violence, but there is little research focusing simultaneously on the two contexts. This study analyzed the role of positive family and classroom environments as protective factors for adolescents' violence against authority (parent abuse and teacher abuse) and the relations between antisocial behavior and child-to-parent violence o...

متن کامل

Parameterized power domination complexity

The optimization problem of measuring all nodes in an electrical network by placing as few measurement units (PMUs) as possible is known as Power Dominating Set. Nodes can be measured indirectly according to Kirchhoff’s law. We show that this problem can be solved in linear time for graphs of bounded treewidth and establish bounds on its parameterized complexity if the number of PMUs is the par...

متن کامل

Generalized power domination of graphs

In this paper, we introduce the concept of k-power domination which is a common generalization of domination and power domination. We extend several known results for power domination to k-power domination. Concerning the complexity of the k-power domination problem, we first show that deciding whether a graph admits a k-power dominating set of size at most t is NP-complete for chordal graphs a...

متن کامل

Power Domination in Honeycomb Meshes

The power domination problem is to find a minimum placement of phase measurement units (PMUs) for observing the whole electric power system represented by a graph G. The number of such a minimum placement of PMUs is called the power domination number of G and is denoted by γp(G). Finding γp(G) of an arbitrary graph is known to be NP-complete. In this paper, we deal with the power domination pro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Contemporary Sociology: A Journal of Reviews

سال: 2019

ISSN: 0094-3061,1939-8638

DOI: 10.1177/0094306118815500dd